JPoT: Just another Populator of TBoxes
نویسنده
چکیده
The OWL2’s populators are currently an important support to empirically evaluate the reasoners and/or to escort the practitioners by leveraging instantiations in their knowledge bases. In this paper, after having evoked the closest approach describing their strengths and weakness, we present Just another Populator of TBOX (JPoT). This purely syntactic and domain independent populator is based on a random process of concept, role and data instantiations guaranteeing consistency of knowledge bases founded on TBOXes expressed in ALCQ(D). Moreover, we demonstrate that data instantiations can be tricky when the expectation of the modeler is to obtain a sound knowledge base able to pass the equivalent of a Turing test. Finally, we evaluate the performances of JPoT.
منابع مشابه
Extending the Description Logic τEL(deg) with Acyclic TBoxes
In a previous paper, we have introduced an extension of the lightweight Description Logic EL that allows us to define concepts in an approximate way. For this purpose, we have defined a graded membership function deg , which for each individual and concept yields a number in the interval [0, 1] expressing the degree to which the individual belongs to the concept. Threshold concepts C∼t for ∼ ∈ ...
متن کاملComplexity of Subsumption in the EL Family of Description Logics: Acyclic and Cyclic TBoxes
We perform an exhaustive study of the complexity of subsumption in the EL family of lightweight description logics w.r.t. acyclic and cyclic TBoxes. It turns out that there are interesting members of this family for which subsumption w.r.t. cyclic TBoxes is tractable, whereas it is EXPTIME-complete w.r.t. general TBoxes. For other extensions that are intractable w.r.t. general TBoxes, we establ...
متن کاملComplexity of Terminological Reasoning Revisited
TBoxes in their various forms are key components of knowledge representation systems based on description logics (DLs) since they allow for a natural representation of terminological knowledge. Largely due to a classical result given by Nebel [15], complexity analyses for DLs have, until now, mostly failed to take into account the most basic form of TBoxes, so-called acyclic TBoxes. In this pap...
متن کاملAutomated Instance Migration between Evolving Ontologies
An ontology, if used for practical purposes like in information systems, contains its controlled vocabulary (TBox) describing the semantics of the domain and the set of facts (ABox) about this domain. The elements of the ABox are ontology instances. If a domain is described by two or more different ontologies or if ontologies evolve, TBoxes are the first place to analyze the differences. Howeve...
متن کاملComputing the lcs w.r.t. General EL+-TBoxes
Recently, exact conditions for the existence of the least common subsumer (lcs) computed w.r.t. general EL-TBoxes have been devised [13]. This paper extends these results and provides necessary and suffcient conditions for the existence of the lcs w.r.t. EL-TBoxes. We show decidability of the existence in PTime and polynomial bounds on the maximal role-depth of the lcs, which in turn yields a c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017